Computational Experience with Generic Decomposition using the DIP Framework
نویسندگان
چکیده
Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution techniques. In particular, the fundamental idea is to exploit our ability to either optimize over and/or separate from the convex hull of solutions to a given relaxation in order to derive improved methods of bounding the optimal solution value. These bounding methods can then be combined with associated methods for branching to obtain a complete branch-and-bound algorithm. This paper concerns a software package called DIP (Decomposition in Integer Programming) that simplifies the process of implementing decomposition-based bounding methods. Used in combination with the COIN-OR High Performance Parallel Search (CHiPPS) framework, DIP provides a complete decomposition-based MILP solver that can be used in either a generic mode in which no customization of algorithm components is required or as a framework in which users can replace generic implementations of various components with versions specialized to a particular problem class.
منابع مشابه
A new Approach Versus Benders Decomposition in Aggregate Production Planning
This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...
متن کاملTwo-stage Stochastic Programing Based on the Accelerated Benders Decomposition for Designing Power Network Design under Uncertainty
In this paper, a comprehensive mathematical model for designing an electric power supply chain network via considering preventive maintenance under risk of network failures is proposed. The risk of capacity disruption of the distribution network is handled via using a two-stage stochastic programming as a framework for modeling the optimization problem. An applied method of planning for the net...
متن کاملIn this paper, the effect of nanocatalytic metal-organic framework based on copper metal and bis-tetrazolamine (CuBTA) ligand functionalized with cobalt (II) oxide nanoparticles on the thermal decomposition behavior of ammonium perchlorate (AP), using differential survey calorimetry (DSC) has been reviewed. First, the metal-organic framework (CuBTA) was synthesized from the raw materials of cop...
متن کاملComputational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
Branch-and-price algorithms based on Dantzig-Wolfe decomposition have shown great success in solving mixed integer linear optimization problems (MILPs) with specific identifiable structure, such as vehicle routing and crew scheduling problems. For unstructured MILPs, the most frequently used methodology is branch-and-cut, which depends on generation of “generic” classes of valid inequalities to...
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کامل